Shrinking one-way cellular automata

Fast one-way cellular automata

Space-bounded one-way cellular language acceptors (OCA) are investigated. The only inclusion known to be strict in their time hierarchy from real-time to exponential-time is between real-time and linear-time! We show the surprising result that there exists an infinite hierarchy of properly included OCA-language families in that range. A generalization of a method in [9] is shown which provides ...

Complexity of One-Way Cellular Automata

The Size of One-Way Cellular Automata

We investigate the descriptional complexity of basic operations on real-time one-way cellular automata with an unbounded as well well as a fixed number of cells. The size of the automata is measured by their number of states. Most of the bounds shown are tight in the order of magnitude, that is, the sizes resulting from the effective constructions given are optimal with respect to worst case co...

A Time Hierarchy for Bounded One-Way Cellular Automata

Space-bounded one-way cellular language acceptors (OCA) are investigated. The only inclusion known to be strict in their time hierarchy from real-time to exponential-time is between real-time and linear-time! We show the surprising result that there exists an infinite hierarchy of properly included OCA-language families in that range. A generalization of a method in [10] is shown that provides ...

VLSI Architecture of a Cellular Automata based One-Way Function

In this paper, a technique to generate expander graphs using Cellular Automata (CA) has been presented. The special class of CA, known as the Two Predecessor Single Attractor Cellular Automata (TPSA CA) has been characterized. It has been shown that the expander graphs built using the TPSA-CA are promising and lead to the development of strong one-way functions. The paper proposes an efficient ...